Personalized Search Engine Using Binary Tree Traversal (BTT) - A Survey

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic Stackless Binary Tree Traversal

A fundamental part of many computer algorithms involves traversing a binary tree. One notable example is traversing a space-partitioning acceleration structure when computing ray-traced images. Traditionally, the traversal requires a stack to be temporarily stored for each ray, which results in both additional storage and memorybandwidth usage. We present a novel algorithm for traversing a bina...

متن کامل

MusiDB: A personalized search engine for music

The increasing use of structured information on the web demands new ways of searching and integrating data from different sources. In this paper, we focus on the use of unique representations of data objects in terms of public repositories (in this case MusicBrainz) and the use of recommendation mechanisms as a basis for supporting information access. We have implemented a prototypical system w...

متن کامل

Connecting Yule Process, Bisection and Binary Search Tree via Martingales

We present new links between some remarkable martingales found in the study of the Binary Search Tree or of the bisection problem, looking at them on the probability space of a continuous time binary branching process.

متن کامل

Nearest Neighbor Search Using Additive Binary Tree

Classifying an unknown input is a fundamental problem in Pattern Recognition. One standard method is finding its nearest neighbors in a reference set. It would be very time consuming if computed feature by feature for all templates in the reference set; this naı̈ve method is O(nd) where n is the number of templates in the reference set and d is the number of features or dimension. For this reaso...

متن کامل

Semantic search engine: A survey

The semantic search engines have some advantages on the web search engines from the users view. In this fast life everybody need the answer for their queries very fast .In this scenario semantic searching engines will be helpful. It deals with the actual meaning of the queries. The tremendous growth in the volume of data or the information lead the traditional search engines to get the answers ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Turkish Journal of Computer and Mathematics Education (TURCOMAT)

سال: 2021

ISSN: 1309-4653

DOI: 10.17762/turcomat.v12i2.2236